全文获取类型
收费全文 | 4512篇 |
免费 | 207篇 |
国内免费 | 271篇 |
专业分类
化学 | 178篇 |
力学 | 186篇 |
综合类 | 31篇 |
数学 | 4010篇 |
物理学 | 585篇 |
出版年
2024年 | 6篇 |
2023年 | 50篇 |
2022年 | 67篇 |
2021年 | 53篇 |
2020年 | 97篇 |
2019年 | 118篇 |
2018年 | 96篇 |
2017年 | 94篇 |
2016年 | 85篇 |
2015年 | 75篇 |
2014年 | 213篇 |
2013年 | 489篇 |
2012年 | 216篇 |
2011年 | 294篇 |
2010年 | 229篇 |
2009年 | 389篇 |
2008年 | 366篇 |
2007年 | 322篇 |
2006年 | 247篇 |
2005年 | 180篇 |
2004年 | 170篇 |
2003年 | 172篇 |
2002年 | 131篇 |
2001年 | 100篇 |
2000年 | 91篇 |
1999年 | 91篇 |
1998年 | 89篇 |
1997年 | 79篇 |
1996年 | 70篇 |
1995年 | 46篇 |
1994年 | 49篇 |
1993年 | 28篇 |
1992年 | 29篇 |
1991年 | 16篇 |
1990年 | 12篇 |
1989年 | 7篇 |
1988年 | 9篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 18篇 |
1984年 | 11篇 |
1983年 | 11篇 |
1982年 | 7篇 |
1981年 | 9篇 |
1980年 | 13篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1977年 | 8篇 |
1973年 | 3篇 |
1970年 | 3篇 |
排序方式: 共有4990条查询结果,搜索用时 31 毫秒
1.
2.
3.
《Discrete Mathematics》2022,345(10):112984
Let G be a generalized dicyclic group with identity 1. An inverse closed subset S of is called minimal if and there exists some such that . In this paper, we characterize distance-regular Cayley graphs of G under the condition that S is minimal. 相似文献
4.
5.
In this paper, we propose a mechanism on how to construct long MDS self-dual codes from short ones. These codes are special types of generalized Reed-Solomon (GRS) codes or extended generalized Reed-Solomon codes. The main tool is utilizing additive structure or multiplicative structure on finite fields. By applying this method, more MDS self-dual codes can be constructed. 相似文献
6.
7.
The Protein Structure Prediction (PSP) problem comprises, among other issues, forecasting the three-dimensional native structure of proteins using only their primary structure information. Most computational studies in this area use synthetic data instead of real biological data. However, the closer to the real-world, the more the impact of results and their applicability. This work presents 17 real protein sequences extracted from the Protein Data Bank for a benchmark to the PSP problem using the tri-dimensional Hydrophobic-Polar with Side-Chains model (3D-HP-SC). The native structure of these proteins was found by maximizing the number of hydrophobic contacts between the side-chains of amino acids. The problem was treated as an optimization problem and solved by means of an Integer Programming approach. Although the method optimally solves the problem, the processing time has an exponential trend. Therefore, due to computational limitations, the method is a proof-of-concept and it is not applicable to large sequences. For unknown sequences, an upper bound of the number of hydrophobic contacts (using this model) can be found, due to a linear relationship with the number of hydrophobic residues. The comparison between the predicted and the biological structures showed that the highest similarity between them was found with distance thresholds around 5.2–8.2 Å. Both the dataset and the programs developed will be freely available to foster further research in the area. 相似文献
8.
The (i) reciprocity relations for the relative Fisher information (RFI, hereafter) and (ii) a generalized RFI–Euler theorem are self-consistently derived from the Hellmann–Feynman theorem. These new reciprocity relations generalize the RFI–Euler theorem and constitute the basis for building up a mathematical Legendre transform structure (LTS, hereafter), akin to that of thermodynamics, that underlies the RFI scenario. This demonstrates the possibility of translating the entire mathematical structure of thermodynamics into a RFI-based theoretical framework. Virial theorems play a prominent role in this endeavor, as a Schrödinger-like equation can be associated to the RFI. Lagrange multipliers are determined invoking the RFI–LTS link and the quantum mechanical virial theorem. An appropriate ansatz allows for the inference of probability density functions (pdf’s, hereafter) and energy-eigenvalues of the above mentioned Schrödinger-like equation. The energy-eigenvalues obtained here via inference are benchmarked against established theoretical and numerical results. A principled theoretical basis to reconstruct the RFI-framework from the FIM framework is established. Numerical examples for exemplary cases are provided. 相似文献
9.
We consider the question whether, given a countable family of lattices in a locally compact abelian group G, there exist functions such that the resulting generalized shift-invariant system is a tight frame of . This paper develops a new approach to the study of generalized shift-invariant system via almost periodic functions, based on a novel unconditional convergence property. From this theory, we derive characterizing relations for tight and dual frame generators, we introduce the system bandwidth as a measure of the total bandwidth a generalized shift-invariant system can carry, and we show that the so-called Calderón sum is uniformly bounded from below for generalized shift-invariant frames. Without the unconditional convergence property, we show, counter intuitively, that even orthonormal bases can have arbitrary small system bandwidth. Our results show that the question of existence of frame generators for a general lattice system is rather subtle and depends on analytical and algebraic properties of the lattice system. 相似文献
10.